Cubic Graphs with Large Circumference Deficit
نویسندگان
چکیده
منابع مشابه
Cubic graphs with large circumference deficit
The circumference c(G) of a graph G is the length of a longest cycle. By exploiting our recent results on resistance of snarks, we construct infinite classes of cyclically 4-, 5and 6-edge-connected cubic graphs with circumference ratio c(G)/|V (G)| bounded from above by 0.876, 0.960 and 0.990, respectively. In contrast, the dominating cycle conjecture implies that the circumference ratio of a c...
متن کاملConstructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer μ0(g), the smallest number of vertices for which a cubic graph with girth at least g exists, and furthermore, the minimum value μ0(g) is attained by a graph whose girth is exactly g. The values of μ0(g) when 3 ≤ g ≤ 8 have been known for over thirty y...
متن کاملMaximum edge-cuts in cubic graphs with large girth and in random cubic graphs
We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with probability at least 0.88672. This implies that G contains an edge-cut of size at least 1.33008n, where n is the number of vertices of G, and has fractional cut covering number at most 1.12776. The lower bound on the si...
متن کاملDomination in Cubic Graphs of Large Girth
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n+O ( n g ) .
متن کاملCovering cubic graphs with matchings of large size
Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of covering the edge-set of G with the minimum number of matchings of size m. This number is called the excessive [m]-index of G in the literature. The case m = n, that is, a covering with perfect matchings, is known to be strictly related to an outstanding conjecture of Berge and Fulkerson. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2015
ISSN: 0364-9024
DOI: 10.1002/jgt.21911